Enhancing the Expressiveness of Spider Diagram Systems

نویسندگان

  • Gem Stapleton
  • John Howse
چکیده

Many visual languages based on Euler diagrams have emerged for expressing relationships between sets. The expressive power of these languages varies, but the majority are monadic and some include equality. Spider diagrams are one such language, being equivalent in expressive power to monadic first order logic with equality. Spiders are used to represent the existence of elements or specific individuals and distinct spiders represent distinct elements. Logical connectives are used to join diagrams, increasing the expressiveness of the language. Spider diagrams that do not incorporate logical connectives are called unitary diagrams. In this paper we explore generalizations of the spider diagram system. We consider the effects of these generalizations on the expressiveness of unitary spider diagrams and on conciseness.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Completeness and Expressiveness of Spider Diagram Systems

Spider diagram systems provide a visual language that extends the popular and intuitive Venn diagrams and Euler circles. Designed to complement object-oriented modelling notations in the specification of large software systems they can be used to reason diagrammatically about sets, their cardinalities and their relationships with other sets. A set of reasoning rules for a spider diagram system ...

متن کامل

On the Relative Expressiveness of Second-Order Spider Diagrams and Regular Expressions

This paper is about spider diagrams, an extension of Euler diagrams that includes syntax to make assertions about set cardinalities. Like many diagrammatic logics, spider diagrams are a monadic and first-order, so they are inexpressive. The limitation to first-order precludes the formalisation of many fundamental concepts such as the cardinality of a set being even. To this end, second-order sp...

متن کامل

Defining star-free regular languages using diagrammatic logic

Spider diagrams are a recently developed visual logic that make statements about relationships between sets, their members and their cardinalities. By contrast, the study of regular languages is one of the oldest active branches of computer science research. The work in this thesis examines the previously unstudied relationship between spider diagrams and regular languages. In this thesis, the ...

متن کامل

Formalizing Spider Diagrams

Geared to complement UML and to the specification of large software systems by non-mathematicians, spider diagrams are a visual language that generalizes the popular and intuitive Venn diagrams and Euler circles. The language design emphasized scalability and expressiveness while retaining intuitiveness. In this extended abstract we describe spider diagrams from a mathematical standpoint and sh...

متن کامل

Reasoning with constraint diagrams

There is a range of visual languages which express logical statements, for example Euler diagrams. The effective use of such languages relies on knowledge about whether a diagram is contradictory and whether reasoning can be performed to transform one diagram into another. It is also desirable to know the expressiveness of such languages. Knowing what a language can and cannot express is import...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006